Superposition Theorem Proving for Albelian Groups Represented as Integer Modules

نویسنده

  • Jürgen Stuber
چکیده

We deene a superposition calculus specialized for abelian groups represented as integer modules, and show its refutational completeness. This allows to substantially reduce the number of inferences compared to a standard superposition prover which applies the axioms directly. Speciically, equational literals are simpliied, so that only the maximal term of the sums is on the left-hand side. Only certain minimal superpositions need to be considered; other superpositions which a standard prover would consider become redundant. This not only reduces the number of inferences, but also reduces the size of the AC-uniication problems which are generated. That is, AC-uniication is not necessary at the top of a term, only below some non-AC-symbol. Further, we consider situations where the axioms give rise to variable overlaps and develop techniques to avoid these explosive cases where possible.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dei: A Theorem Prover for Terms with Integer Exponents

An extension of the superposition-based E-prover [8] is described. The extension allows terms with integer exponents [3] in the input language. Obviously, this possibility increases the capabilities of the E-prover particularly for preventing non-termination.

متن کامل

Representation of Integers by Ternary Quadratic Forms: a Geometric Approach

In 1957 N.C. Ankeny provided a new proof of the three squares theorem using geometry of numbers. This paper generalizes Ankeny’s technique, proving exactly which integers are represented by x2 + 2y2 + 2z2 and x2 + y2 + 2z2 as well as proving su cient conditions for an integer to be represented by x2 + y2 + 3z2 and x2 + y2 + 7z2.

متن کامل

Max-planck-institut F  Ur Informatik Theorem Proving in Cancellative Abelian Monoids Publication Notes

We describe a re ned superposition calculus for cancellative abelian monoids. They encompass not only abelian groups, but also such ubiquitous structures as the natural numbers or multisets. Both the AC axioms and the cancellation law are di cult for a general purpose superposition theorem prover, as they create many variants of clauses which contain sums. Our calculus requires neither explicit...

متن کامل

Strict Basic Superposition and Chaining

The most efficient techniques that have been developed to date for equality handling in first-order theorem proving are based on superposition calculi. Superposition is a refinement of paramodulation in that various ordering constraints are imposed on inferences. For practical purposes, a key aspect of superposition is its compatibility with powerful simplification techniques. In this paper we ...

متن کامل

Theorem Proving in

Cancellative abelian monoids encompass abelian groups, but also such ubiquitous structures as the natural numbers or multisets. Both the AC axioms and the cancellation law are diicult for a general purpose theorem prover, as they create many variants of clauses which contain sums. We describe a reened superposition calculus for cancellative abelian monoids which requires neither explicit infere...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996